Exact Unification and Admissibility
نویسندگان
چکیده
منابع مشابه
Exact Unification and Admissibility
A new hierarchy of “exact” unification types is introduced, motivated by the study of admissible rules for equational classes and non-classical logics. In this setting, unifiers of identities in an equational class are preordered, not by instantiation, but rather by inclusion over the corresponding sets of unified identities. Minimal complete sets of unifiers under this new preordering always h...
متن کاملFrom Admissibility to a New Hierarchy of Unification Types
Motivated by the study of admissible rules, a new hierarchy of “exact” unification types is introduced where a unifier is more general than another unifier if all identities unified by the first are unified by the second. A Ghilardi-style algebraic interpretation of this hierarchy is presented that features exact algebras rather than projective algebras. Examples of equational classes distingui...
متن کاملThe Exact Unification Type of Commutative Theories
The exact unification type of an equational theory is based on a new preorder on substitutions, called the exactness preorder, which is tailored towards transferring decidability results for unification to disunification. We show that two important results regarding the unification type of commutative theories hold not only for the usual instantiation preorder, but also for the exactness preord...
متن کاملMulti-modal and Temporal Logics with Universal Formula - Reduction of Admissibility to Validity and Unification
The article studies multi-modal (in particular temporal, tense, logics) possessing universal formulas. We prove (Theorems 11 and 12) that the admissibility problem for inference rules (inference rules with parameters) is decidable for all decidable multi-modal (in particular, temporal) logics possessing an universal formula and decidable w.r.t. unification (unification with parameters). These t...
متن کاملToward unification of exact and heuristic optimization methods
This paper argues that many exact and heuristic methods have common structure that permits some degree of unification. It interprets solution algorithms as primal-dual methods in which the primal component searches over problem restrictions, and the dual component obtains bounds on the optimal value. In particular, the concept of an inference dual provides the basis for constraint-directed sear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2015
ISSN: 1860-5974
DOI: 10.2168/lmcs-11(3:23)2015